Ela Note on Deleting a Vertex and Weak Interlacing of the Laplacian Spectrum∗
نویسنده
چکیده
The question of what happens to the eigenvalues of the Laplacian of a graph when we delete a vertex is addressed. It is shown that λi − 1 ≤ λi ≤ λi+1, where λi is the ith smallest eigenvalues of the Laplacian of the original graph and λ v i is the ith smallest eigenvalues of the Laplacian of the graph G[V −v]; i.e., the graph obtained after removing the vertex v. It is shown that the average number of leaves in a random spanning tree F(G) > 2|E|e −1 α λn , if λ2 > αn.
منابع مشابه
Note on deleting a vertex and weak interlacing of the Laplacian spectrum
The question of what happens to the eigenvalues of the Laplacian of a graph when we delete a vertex is addressed. It is shown that λi − 1 ≤ λi ≤ λi+1, where λi is the ith smallest eigenvalues of the Laplacian of the original graph and λ v i is the ith smallest eigenvalues of the Laplacian of the graph G[V −v]; i.e., the graph obtained after removing the vertex v. It is shown that the average nu...
متن کاملEla Interlacing for Weighted Graphs Using the Normalized Laplacian∗
The problem of relating the eigenvalues of the normalized Laplacian for a weighted graph G and G − H, for H a subgraph of G is considered. It is shown that these eigenvalues interlace and that the tightness of the interlacing is dependent on the number of nonisolated vertices of H. Weak coverings of a weighted graph are also defined and interlacing results for the normalized Laplacian for such ...
متن کاملEla the Smallest Signless Laplacian Eigenvalue of Graphs under Perturbation
In this paper, we investigate how the smallest signless Laplacian eigenvalue of a graph behaves when the graph is perturbed by deleting a vertex, subdividing edges or moving edges.
متن کاملOn the Spectrum of the Normalized Laplacian for Signed Graphs: Interlacing, Contraction, and Replication
We consider the normalized Laplacian matrix for signed graphs and derive interlacing results for its spectrum. In particular, we investigate the effects of several basic graph operations, such as edge removal and addition and vertex contraction, on the Laplacian eigenvalues. We also study vertex replication, whereby a vertex in the graph is duplicated together with its neighboring relations. Th...
متن کاملEla Disjoint Unions of Complete Graphs Characterized by Their Laplacian Spectrum∗
A disjoint union of complete graphs is in general not determined by its Laplacian spectrum. It is shown in this paper that if one only considers the family of graphs without isolated vertex, then a disjoint union of complete graphs is determined by its Laplacian spectrum within this family. Moreover, it is shown that the disjoint union of two complete graphs with a and b vertices, a b > 5 3 and...
متن کامل